Knowledge-Level Analysis of Belief Base Operations

نویسنده

  • Sven Ove Hansson
چکیده

Recent developments in philosophical studies of belief revision have led to the construction of models that are much closer to actual computing systems than the earlier models. An operation of contraction (revision) on a logically closed belief set can be obtained by assigning to it a finite belief base and an operation of contraction (revision) on that base. Exact characterizations of such base-generated operations have been obtained. In this way, computational tractability and other realistic properties of operations on finite bases can be combined with a precise analysis that is independent of the symbolic representation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knowledge State Reconsideration: Hindsight Belief Revision

As a knowledge representation and reasoning (KRR) system gathers and reasons about information, it has to update its belief space to maintain consistency. Some belief change operations it can perform include expansion (addition with no consistency checking), contraction (aka removal or retraction), revision (consistent prioritized addition), and consolidation (elimination of any and all inconsi...

متن کامل

Semantics of First Order Belief RevisionBased on Circumscription

The AGM postulates for knowledge base revision are a set of rationality postulates that revision operations on knowledge systems should satisfy. Deening an appropriate semantics for belief revision that satisses all of the postulates has been considered a challenging problem. In this paper we present a novel application of circumscription to deening a semantics of belief revision systems. First...

متن کامل

Base Revision in Description Logics - Preliminary Results

Belief Revision deals with the problem of adding new information to a knowledge base in a consistent way. The theory has been developed having in mind classical logics. In this paper, we show some problems of applying belief revision methods directly to ontologies represented in description logics and propose new operations that overcome these problems.

متن کامل

A consistency-based approach for belief change

This paper presents a general, consistency-based framework for expressing belief change. The framework has good formal properties while being well-suited for implementation. For belief revision, informally, in revising a knowledge base K by a sentence α, we begin with α and include as much of K as consistently possible. This is done by expressing K and α in disjoint languages, asserting that th...

متن کامل

Kernel Contraction and Base Dependence: Redundancy in the Base Resulting in Different Types of Dependence

The AGM paradigm of belief change studies the dynamics of belief states in light of new information. Finding, or even approximating, dependent or relevant beliefs to a change is valuable because, for example, it can narrow the set of beliefs considered during belief change operations. Gärdenfors’ preservation criterion (GPC) suggests that formulas independent of a belief change should remain in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Artif. Intell.

دوره 82  شماره 

صفحات  -

تاریخ انتشار 1996